Directed covering with block size 5 and v even
نویسندگان
چکیده
A directed covering design, DC(v, k, λ), is a (v, k, 2λ) covering design in which the blocks are regarded as ordered k-tuples and in which each ordered pair of elements occurs in at least λ blocks. Let DE(v, k, λ) denote the minimum number of blocks in a DC(v, k, λ). In this paper the values of the function DE(v, 5, λ) are determined for all even integers v ≥ 5 and λ odd.
منابع مشابه
Directed packings with block size 5 and odd v
Let DD(5, 1; v) denote the packing number of a directed packing with block size 5 and index unity. It has been determined in [10] that DD(5, 1; v) = l2(:-1 JJ where v even. In this paper, the values of DD(5, 1; v) for all v are determined, with the possible exceptions of v 15, 19, 27.
متن کاملOn covering designs with block size 5 and index 11≤λ≤21: the case v≡0(mod 4)
Let V be a finite set of order v. A (v,k,A.) covering design of index A. and block size k is a collection of k-element subsets, called blocks, such that every 2-subset of V occurs in at least '}.. blocks. The covering problem is to determine the minimum number of blocks, a (v, k, A.), in a covering design. It is well known that a(v,k''}..)Lr~~=~'}..ll=(v,k,A.), where rxl is the smallest integer
متن کاملDirected packings with block size 5
Let v ~ 5 and A be positive integers and let DD(v,k,A) denote the packing number of a directed packing with block size 5 and index A. The values of DD(v, 5, A) have been determined for A = 1,2 with the possible exceptions of (v, A) = (15,1) (19,1) (27,1), [7,8, 19]. In this paper we determine the values of DD(v, 5, A) for all v ~ 5 and A ~ 3 except possibly (v, A) = (43,3).
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملOn directed designs with block size five
In a t-(v, k, λ) directed design the blocks are ordered k-tuples and every ordered t-tuple of distinct points occurs in exactly λ blocks (as a subsequence). We study t-(v, 5, 1) directed designs with t = 3 and t = 4. In particular, we construct the first known examples, and an infinite class, of 3-(v, 5, 1) directed designs, and the first known infinite class of 4-(v, 5, 1) directed designs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 28 شماره
صفحات -
تاریخ انتشار 2003